An Efficient Voting Algorithm for Finding Additive Biclusters with Random Background
نویسندگان
چکیده
منابع مشابه
Finding Additive Biclusters with Random Background
The biclustering problem has been extensively studied in many areas including e-commerce, data mining, machine learning, pattern recognition, statistics, and more recently in computational biology. Given an n m matrix A (n m), the main goal of biclustering is to identify a subset of rows (called objects) and a subset of columns (called properties) such that some objective function that specifie...
متن کاملFinding Biclusters by Random Projections
Given a matrix X composed of symbols, a bicluster is a submatrix of X obtained by removing some of the rows and some of the columns of X in such a way that each row of what is left reads the same string. In this paper, we are concerned with the problem of finding the bicluster with the largest area in a large matrix X. The problem is first proved to be NP-complete. We present a fast and efficie...
متن کاملAn Efficient Approximate Algorithm for Finding Paths with Two Additive Constraints∗
The problem of finding a path with two additive constraints, in particular finding a path that satisfies both the cost and the delay constraints, is called multi-constrained path (MCP) problem in the literature. In this paper, we explore the MCP problem based on the idea of single mixed weight—a mixed weight for each link is first obtained by combining its delay and cost, and then Dijkstra’s al...
متن کاملFinding distinct biclusters from background in gene expression matrices
Biclustering, or the discovery of subsets of samples and genes that are homogeneous and distinct from the background, has become an important technique in analyzing current microarray datasets. Most existing biclustering methods define a bicluster type as a fixed (predefined) pattern and then trying to get results in some searching process. In this work, we propose a novel method for finding bi...
متن کاملAn efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Biology
سال: 2008
ISSN: 1066-5277,1557-8666
DOI: 10.1089/cmb.2007.0219